Simultaneous diagonalization of rectangular matrices
نویسندگان
چکیده
منابع مشابه
On Simultaneous Block-Diagonalization of Cyclic Commuting Matrices
We study simultaneous block-diagonalization of cyclic d-tuples of commuting matrices. Some application to ideal projectors are also presented. In particular we extend Hans Stetters theorem characterizing Lagrange projectors. 1 Introduction Let V be a nite-dimensional space over complex eld C and let L := (L1; :::; Ld) be a d-tuple of pairwise commuting operators on V . Every polynomial p(x1;...
متن کاملAlgorithm for Error-Controlled Simultaneous Block-Diagonalization of Matrices
An algorithm is given for the problem of finding the finest simultaneous block-diagonalization of a given set of square matrices. This problem has been studied independently in the area of semidefinite programming and independent component analysis. The proposed algorithm considers the commutant algebra of the matrix ∗-algebra generated by the given matrices. It is simpler than other existing m...
متن کاملDiagonalization of Sp(2) matrices
The two-by-two Sp(2) matrix has three parameters with unit determinant. Yet, there are no established procedures for diagonalizing this matrix. It is shown that this matrix can be written as a similarity transformation of the two-by-two Wigner matrix, derivable from Wigner’s little group which dictates the internal space-time symmetries of relativistic particles. The Wigner matrix can be diagon...
متن کاملQuantum Diagonalization of Hermitean Matrices
To measure an observable of a quantum mechanical system leaves it in one of its eigenstates and the result of the measurement is one of its eigenvalues. This process is shown to be a computational resource. It allows one, in principle, to diagonalize hermitean (N × N) matrices by quantum mechanical measurements only. To do so, one considers the given matrix as an observable of a single spin wit...
متن کاملScaling Up Simultaneous Diagonalization
Simultaneous matrix diagonalization is a key subroutine in many machine learning problems, including blind source separation and parameter estimation in latent variable models. Here, we extend joint diagonalization algorithms to low-rank and asymmetric matrices and also provide extensions to the perturbation analysis of these methods. Our results allow joint diagonalization to scale to larger p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1997
ISSN: 0898-1221
DOI: 10.1016/s0898-1221(97)00068-0